Description: 用C++实现Josephus约瑟夫问题，简单的小程序，供初学者参考-In C++ implementation Josephus Josephus problem, a small little program Platform: |
Size: 569344 |
Author:Seraph6688 |
Hits:
Description: 约瑟夫问题c语言解决方法 数据结构方法解决问题-The solve of the josephus problem by c language Data structure method Solve problems Platform: |
Size: 1024 |
Author:肖童 |
Hits:
Description: 据说着名犹太历史学家Josephus有过以下的故事：在罗马人占领乔塔帕特后，39 个犹
太人与Josephus及他的朋友躲到一个洞中，39个犹太人决定宁愿死也不要被敌人到，于是决定了
一个自杀方式，41个人排成一个圆圈，由第1个人开始报数，每报数到第3人该人就必须自杀，
然后再由下一个重新报数，直到所有人都自杀身亡为止。
然而Josephus 和他的朋友并不想遵从，Josephus要他的朋友先假装遵从，他将朋友与自己安排
在第16个与第31个位置，于是逃过了这场死亡游戏。
此程序为求解自杀顺序的程序。-It is said that the Jewish historian Josephus had the following story: After the Roman occupation Qiaotapate, 39 still
Jews and Josephus and his friends hid in a cave, 39 Jews were the enemy decided to rather die than do not, then determine the
A suicide, 41 individuals arranged in a circle, from the first few individuals began to report, report number to each of the three people who have to commit suicide,
And then re-reported by the next number, until all committed suicide so far.
However, Josephus and his friends did not want to comply, Josephus first pretended to follow his friends, he arranged with his friends
In the first 16 with the first 31 positions, so escaped death in this game.
This procedure is the procedure in order to solve suicide. Platform: |
Size: 1024 |
Author:lilianyin |
Hits:
Description: 约瑟夫(Josephus)环问题
设n个人围坐在一个圆桌周围，现在从第s个人开始报数，数到第m个人，让他出局；然后从出局的下一个人重新开始报数，数到第m个人，再让他出局，如此反复直到所有的人全部出局为止。
下面要解决的约瑟夫(Josephus)环问题是：对于任意给定的n，s和m，求出这n个人的出局序列。要求以单循环链表作为存储结构，实现约瑟夫环问题。然后使用n=9，s=1，m=5，以及n=9，s=1，m=10作为输入数据，检查你的程序的正确性和健壮性。
-Joseph (Josephus,) Central problem set of n individuals sitting around a round table around, from the s personal number off, count to the m-th individual, let him out then start again from out the next person reported that the number, the number to m individuals, to let him out, and so forth until all the people all out so far. The following to solve Joseph (Josephus,) ring question is: for any given n, s and m, find out the sequence of the n individuals. Requirements as a single cycle linked list storage structure, the Josephus problem. And then use the n = 9, s = 1, m = 5 and n = 9, s = 1, m = 10 as input data to check the correctness and robustness of your program. Platform: |
Size: 44032 |
Author:winner |
Hits:
Description: 约瑟夫环问题：设编号为1，2，3，……，n的n(n>0)个人按顺时针方向围坐一圈，每个人持有一个正整数密码。开始时任选一个正整数做为报数上限m，从第一个人开始顺时针方向自1起顺序报数，报到m是停止报数，报m的人出列，将他的密码作为新的m值，从他的下一个人开始重新从1报数。如此下去，直到所有人全部出列为止。令n最大值取30。要求设计一个程序模拟此过程，求出出列编号序列-Josephus problem: Let numbered 1, 2, 3, ...... n n (n> 0) individuals sitting around a circle in a clockwise direction, each person holds a positive integer password. Optional when the start of a positive integer as reported the maximum number of m clockwise direction from the first person, self-a starting sequence reported number, report m stop the reported number of reported m the column, as a new password the value of m, start again from 1 number off from his next personal. It goes on, until all the columns until all. Let n be the maximum take 30. Asked to design a program to simulate the process, find the column number sequence Platform: |
Size: 6144 |
Author:梁颖 |
Hits:
Description: 约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的人的序号为5，4，6，2，3。最后剩下1号。
假定在圈子里前K个为好人，后K个为坏人，你的任务是确定这样的最少M，使得所有的坏人在第一个好人之前被杀掉。-Josephus problem is a well-known problem: N personal circle, starting from the first report the number of M will be killed first, the last remaining one, the rest will be killed. For example, N = 6, M = 5, the number of people killed 5,4,6,2,3. The last remaining No. 1. Assumed that the first K in circles as a good man, after the K was bad person, your task is to determine this minimum M, makes all the bad guys in a good man before being killed. Platform: |
Size: 894976 |
Author:cyr |
Hits:
Description: 约瑟夫环问题
【问题描述】
Josephus排列问题定义如下：假设n个竞赛者排成一个环形。给定一个正整数m≤n，从第1人开始，沿环计数，第m人出列。这个过程一直进行到所有人都出列为止。最后出列者为优胜者。全部出列次序定义了1，2，…n的一个排列。称为（n，m）Josephus排列。例如，（7，3）Josephus排列为3,6,2,7,5,1,4。
【实验要求】
设计求解Josephus排列问题程序。
（1）采用顺序表、单链表或双向循环链表等数据结构。
（2）采用双向循环链表实现Josephus排列问题，且奇数次顺时针轮转，偶数次逆时针轮转。
（3）推荐采用静态链表实现Josephus排列问题
-Josephus Josephus problem [Problem Description] permutation problem is defined as follows: Suppose the n contestants lined up a ring. Given a positive integer m 鈮?n, beginning from the first one, along the ring count, the first man out of the line m. This process continues until everyone is out of the line so far. Finally out of the line by the winner. All the columns defined sequence 1,2, ... n of an order. Called (n, m) Josephus order. For example, (7,3) Josephus arranged 3,6,2,7,5,1,4. Experimental Design [requirements] Josephus permutation problem solving process. (1) using the order form, single chain or two-way circular linked list data structure. (2) using two-way circular linked list implementation Josephus permutation problem, and the odd clockwise rotation, counterclockwise rotation even number of times. (3) recommend the use of a static list to achieve Josephus permutation problem Platform: |
Size: 34816 |
Author:张小红 |
Hits:
Description: Josephus问题：设n个人围坐在一个圆桌周围，从第s个人开始数数，数到m的人，让他出局，然后从出局的人的下一个人开始重新开始数数，数到m的人，再让他出局，……，知道全部出局为止-Josephus problem: Let n individuals sitting at a round table, from the first s personal began to count, count to m, let him out, then the next person out of the people began to re-start count, count to m man, let him out, ......, knowing all out date Platform: |
Size: 6199296 |
Author:Anita |
Hits:
Description: 数据结构中基于约瑟夫环问题，用C++方式实现的-Data structure based on Josephus problem with C++ a manner. . . . . Platform: |
Size: 1024 |
Author:liuyuan |
Hits:
Description: 约瑟夫环是一个数学的应用问题。 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 这个就是约瑟夫环问题的实际场景，有一种是要通过输入n,m,k三个正整数，来求出列的序列。-Josephus is the application of a mathematical problem. Known n individuals (with numbers 1,2,3 ... n, respectively) were sitting around a round table. From the number of people reported a few k, m is the number of out of that person his next and from one individual to start off, count to m that another person out so the law of repeated until the round table were all out of the column. This is the actual scene Josephus problem, one of which is through the input n, m, k three positive integers, to determine the sequence of the column. Platform: |
Size: 1024 |
Author:佘晓凤 |
Hits:
Description: 数据结构实验求解Josephus问题，用C语言实现，单循环链表结构。-Experimental data structure to solve the Josephus problem, using C language, round robin list structure. Platform: |
Size: 1024 |
Author:mafangyuan |
Hits:
Description: 用简短的代码解决约瑟夫问题，只是我上传的第一段代码，请笑纳。-solve the Josephus problem with currency. It is short but I am sincerely. Platform: |
Size: 1731584 |
Author:CZG |
Hits:
Search - Josephus problem